Survey: Tree Transducers in Machine Translation

Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation

In this second part of the survey, we present the application of weighted extended topdown tree transducers in machine translation, which is the automatic translation of natural language texts. We present several formal properties that are relevant in machine translation and evaluate the weighted extended top-down tree transducer along those criteria. In addition, we demonstrate how to extract ...

Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power

Weighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP’76. Edinburgh University Press. 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine translation. This survey presents the foundations for a theoretical analysis of weighted extended top-down t...

Application of Tree Transducers in Statistical Machine Translation

Extended Tree Transducers in Natural Language Processing

Tree transducers are finite-state devices computing relations on trees. Their study was initiated by Thatcher (1970) and Rounds (1970), who established the classical top-down tree transducers that process the input tree from the root towards the leaves. Shortly afterwards, Baker (1973) introduced the bottom-up tree transducers that process the input tree from the leaves towards the root in anal...

Tree Transducers, Machine Translation, and Cross-Language Divergences

Tree transducers are formal automata that transform trees into other trees. Many varieties of tree transducers have been explored in the automata theory literature, and more recently, in the machine translation literature. In this paper I review T and xT transducers, situate them among related formalisms, and show how they can be used to implement rules for machine translation systems that cove...